On the computation of the fundamental subspaces for descriptor systems

نویسندگان

  • Christina Kazantzidou
  • Lorenzo Ntogramatzidis
چکیده

In this paper, we investigate several theoretical and computational aspects of fundamental subspaces for linear, time-invariant (LTI) descriptor systems, which appear in the solution of many control and estimation problems. Different types of reachability and controllability for descriptor systems are described and discussed. The Rosenbrock system matrix pencil is employed for the computation of supremal output-nulling subspaces and supremal output-nulling reachability subspaces for descriptor systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pure First Order Representation for Undamped Second Order Descriptor Systems

The aim of this paper is to analyze the undamped second order descriptor systems to show the possibility of transform an undamped second order descriptor system to a pure first order descriptor system ,on different ways, while stating some of its benefits. Meanwhile we will introduce pure first order systems and undamped second order systems and indicate that under some assumptions every undamp...

متن کامل

Numerical Solution of Linear - Quadratic Control

We discuss the numerical solution of linear quadratic optimal control problems for descriptor systems. The classical solution approach for these problems requires the computation of deeating subspaces of structured pencils. We extend the recently developed methods 6] for Hamiltonian matrices to the general case of embedded pencils as they arise in descriptor systems.

متن کامل

Partial Eigenvalue Assignment in Discrete-time Descriptor Systems via Derivative State Feedback

A method for solving the descriptor discrete-time linear system is focused. For easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. Then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. In partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...

متن کامل

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

متن کامل

A new method for accelerating impossible differential cryptanalysis and its application on LBlock

Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Control

دوره 89  شماره 

صفحات  -

تاریخ انتشار 2016